Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords

We analyze Linear Programming (LP) decoding of graphical binary codes operating over soft-output, symmetric and log-concave channels. We show that the error-surface, separating domain of the correct decoding from domain of the erroneous decoding, is a polytope. We formulate the problem of finding the lowest-weight pseudo-codeword as a non-convex optimization (maximization of a convex function) over a polytope, with the cost function defined by the channel and the polytope defined by the structure of the code. This formulation suggests new provably convergent heuristics for finding the lowest weight pseudo-codewords improving in quality upon previously discussed. The algorithm performance is tested on the example of the Tanner [155, 64, 20] code over the Additive White Gaussian Noise (AWGN) channel.Comment: 6 pages, 2 figures, accepted for IEEE ISIT 201

Mean Field Control for Efficient Mixing of Energy Loads

We pose an engineering challenge of controlling an Ensemble of Energy Devices via coordinated, implementation-light and randomized on/off switching as a problem in Non-Equilibrium Statistical Mechanics. We show that Mean Field Control} with nonlinear feedback on the cumulative consumption, assumed available to the aggregator via direct physical measurements of the energy flow, allows the ensemble to recover from its use in the Demand Response regime, i.e. transition to a statistical steady state, significantly faster than in the case of the fixed feedback. Moreover when the nonlinearity is sufficiently strong, one observes the phenomenon of "super-relaxation" -- where the total instantaneous energy consumption of the ensemble transitions to the steady state much faster than the underlying probability distribution of the devices over their state space, while also leaving almost no devices outside of the comfort zone.Comment: 7 pages, 5 figure